Uniform Contractification
نویسندگان
چکیده
منابع مشابه
Uniform connectedness and uniform local connectedness for lattice-valued uniform convergence spaces
We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...
متن کاملUNIFORM AND SEMI-UNIFORM TOPOLOGY ON GENERAL FUZZY AUTOMATA
In this paper, we dene the concepts of compatibility between twofuzzy subsets on Q, the set of states of a max- min general fuzzy automatonand transitivity in a max-min general fuzzy automaton. We then construct auniform structure on Q, and dene a topology on it. We also dene the conceptof semi-uniform structures on a nonempty set X and construct a semi-uniformstructure on the set of states of ...
متن کاملUniform measures and uniform rectifiability
In this paper it is shown that if μ is an n-dimensional Ahlfors-David regular measure in R which satisfies the so-called weak constant density condition, then μ is uniformly rectifiable. This had already been proved by David and Semmes in the cases n = 1, 2 and d − 1, and it was an open problem for other values of n. The proof of this result relies on the study of the n-uniform measures in R. I...
متن کاملUniform and Partially Uniform Redistribution Rules
This short paper introduces two new fusion rules for combining quantitative basic belief assignments. These rules although very simple have not been proposed in literature so far and could serve as useful alternatives because of their low computation cost with respect to the recent advanced Proportional Conflict Redistribution rules developed in the DSmT framework.
متن کاملUniform Characterizations of Non-Uniform Complexity Measures
Non-uniform complexity measures originated in automata and formal languages theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits, straight line programs, and Turing machines with sparse oracles and time or space bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 1978
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-1978-014-0